On Acyclic Vertex Coloring of Grid like graphs
نویسندگان
چکیده
d-dimensional partial tori are graphs that can be expressed as cartesian product of d graphs each of which is an induced path or cycle. Some well known graphs like d-dimensional hypercubes, meshes and tori are examples belong to this class. Muthu et al.[MNS06] have studied the problem of acyclic edge coloring for such graphs. We try to explore the acyclic vertex coloring problem for these graphs. In this respect, we provide coloring schemes to acyclically color a few basic graphs of this class such that at least one of the factor graphs is an induced cycle. Some of our schemes are optimal while others are close to optimal.
منابع مشابه
Acyclic Colorings of Products of Cycles
An acyclic coloring of a graph G is a proper coloring of the vertex set of G such that G contains no bichromatic cycles. The acyclic chromatic number of a graph G is the minimum number k such that G has an acyclic coloring with k colors. In this paper, acyclic colorings of products of paths and cycles are considered. We determine the acyclic chromatic numbers of three such products: grid graphs...
متن کاملAcyclic and k-distance coloring of the grid
In this paper, we give a relatively simple though very efficient way to color the d-dimensional grid G(n1, n2, . . . , nd) (with ni vertices in each dimension 1 i d), for two different types of vertex colorings: (1) acyclic coloring of graphs, in which we color the vertices such that (i) no two neighbors are assigned the same color and (ii) for any two colors i and j , the subgraph induced by t...
متن کاملAcyclic 3-Colorings and 4-Colorings of Planar Graph Subdivisions
An acyclic coloring of a graph G is an assignment of colors to the vertices of G such that no two adjacent vertices receive the same color and every cycle in G has vertices of at least three different colors. An acyclic k-coloring of G is an acyclic coloring of G with at most k colors. It is NP-complete to decide whether a planar graph G with maximum degree four admits an acyclic 3-coloring [1]...
متن کاملAcyclic Vertex Coloring of Graphs of Maximum Degree
An acyclic vertex coloring of a graph is a proper vertex coloring such that there are no bichromatic cycles. The acyclic chromatic number of G, denoted a(G), is the minimum number of colors required for acyclic vertex coloring of graph G = (V,E). For a family F of graphs, the acyclic chromatic number of F , denoted by a(F), is defined as the maximum a(G) over all the graphs G ∈ F . In this pape...
متن کاملAcyclic vertex coloring of graphs of maximum degree 5
An acyclic vertex coloring of a graph is a proper vertex coloring such that there are no bichromatic cycles. The acyclic chromatic number of G, denoted a(G), is the minimum number of colors required for acyclic vertex coloring of a graph G = (V,E). For a family F of graphs, the acyclic chromatic number of F , denoted by a(F ), is defined as the maximum a(G) over all the graphs G ∈ F . In this p...
متن کامل